Representative-based classification through covering-based neighborhood rough sets
نویسندگان
چکیده
منابع مشابه
Neighborhood operators for covering-based rough sets
Covering-based rough sets are important generalizations of the classical rough sets of Pawlak. A common way to shape lower and upper approximations within this framework is by means of a neighborhood operator. In this article, we study 24 such neighborhood operators that can be derived from a single covering. We verify equalities between them, reducing the original collection to 13 different ne...
متن کاملCovering-based fuzzy rough sets
Many researchers have combined rough set theory and fuzzy set theory in order to easily approach problems of imprecision and uncertainty. Covering-based rough sets are one of the important generalizations of classical rough sets. Naturally, covering-based fuzzy rough sets can be studied as a combination of covering-based rough set theory and fuzzy set theory. It is clear that Pawlak’s rough set...
متن کاملCovering Numbers in Covering-Based Rough Sets
Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...
متن کاملNew Neighborhood Based Rough Sets
Neighborhood based rough sets are important generalizations of the classical rough sets of Pawlak, as neighborhood operators generalize equivalence classes. In this article, we introduce nine neighborhood based operators and we study the partial order relations between twenty-two different neighborhood operators obtained from one covering. Seven neighborhood operators result in new rough set ap...
متن کاملGeometric lattice structure of covering-based rough sets through matroids
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role in covering reductions. In this paper, we construct four geometric lattice structures of covering-based rough sets through matroids, and compare their relatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Intelligence
سال: 2015
ISSN: 0924-669X,1573-7497
DOI: 10.1007/s10489-015-0687-5